Abstract Views :265 |
PDF Views:0
Authors
Affiliations
1 Singhania University, Jhunjhunu, Rajsthan, IN
2 Department of Mathematics, R. K. G. Institute of Technology, Ghaziabad, U.P., IN
Source
International Journal of Advanced Networking and Applications, Vol 2, No 4 (2011), Pagination: 780-783
Abstract
This paper presents a key agreement protocol based on a non abelian group. It is proved that the proposed protocol meets several security attributes under the assumption that the Root Problem (RP) in braid group is a hard problem.
Keywords
Non Abelian Group, Braid Group, Root Problem, Key Agreement, and Security.
Full Text